A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE
نویسندگان
چکیده
منابع مشابه
Solving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملsolving single machine sequencing to minimize maximum lateness problem using mixed integer programming
despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...
متن کاملiranian english learners’ perception and personality: a dual approach to investigating influential factors on willingness to communicate
abstract previous studies on willingness to communicate (wtc) have shown the influence of many individual or situational factors on students’ tendency to engage in classroom communication, in which wtc has been viewed either at the trait-level or situational level. however, due to the complexity of the notion of willingness to communicate, the present study suggests that these two strands are ...
A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملA Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem
We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2015
ISSN: 1012-277X,2224-7890
DOI: 10.7166/26-3-1030